Survival probability of large rapidity gaps in QCD and N=4 SYM motivated model

In this paper we present a self consistent theoretical approach for the calculation of the Survival Probability for central dijet production . These calculations are performed in a model of high energy soft interactions based on two ingredients:(i) the results of N=4 SYM, which at the moment is the only theory that is able to deal with a large coupling constant; and (ii) the required matching with high energy QCD. Assuming, in accordance with these prerequisites, that soft Pomeron intercept is rather large and the slope of the Pomeron trajectory is equal to zero, we derive analytical formulae that sum both enhanced and semi-enhanced diagrams for elastic and diffractive amplitudes. Using parameters obtained from a fit to the available experimental data, we calculate the Survival Probability for central dijet production at energies accessible at the LHC. The results presented here which include the contribution of semi-enhanced and net diagrams, are considerably larger than our previous estimates.Comment: 11 pages, 10 pictures in .eps file

Weak Parity

We study the query complexity of Weak Parity: the problem of computing the parity of an n-bit input string, where one only has to succeed on a 1/2+eps fraction of input strings, but must do so with high probability on those inputs where one does succeed. It is well-known that n randomized queries and n/2 quantum queries are needed to compute parity on all inputs. But surprisingly, we give a randomized algorithm for Weak Parity that makes only O(n/log^0.246(1/eps)) queries, as well as a quantum algorithm that makes only O(n/sqrt(log(1/eps))) queries. We also prove a lower bound of Omega(n/log(1/eps)) in both cases; and using extremal combinatorics, prove lower bounds of Omega(log n) in the randomized case and Omega(sqrt(log n)) in the quantum case for any eps>0. We show that improving our lower bounds is intimately related to two longstanding open problems about Boolean functions: the Sensitivity Conjecture, and the relationships between query complexity and polynomial degree.Comment: 18 page

Morphing Planar Graph Drawings Optimally

We provide an algorithm for computing a planar morph between any two planar straight-line drawings of any $n$-vertex plane graph in $O(n)$ morphing steps, thus improving upon the previously best known $O(n^2)$ upper bound. Further, we prove that our algorithm is optimal, that is, we show that there exist two planar straight-line drawings $\Gamma_s$ and $\Gamma_t$ of an $n$-vertex plane graph $G$ such that any planar morph between $\Gamma_s$ and $\Gamma_t$ requires $\Omega(n)$ morphing steps

Tighter Relations Between Sensitivity and Other Complexity Measures

Sensitivity conjecture is a longstanding and fundamental open problem in the area of complexity measures of Boolean functions and decision tree complexity. The conjecture postulates that the maximum sensitivity of a Boolean function is polynomially related to other major complexity measures. Despite much attention to the problem and major advances in analysis of Boolean functions in the past decade, the problem remains wide open with no positive result toward the conjecture since the work of Kenyon and Kutin from 2004. In this work, we present new upper bounds for various complexity measures in terms of sensitivity improving the bounds provided by Kenyon and Kutin. Specifically, we show that deg(f)^{1-o(1)}=O(2^{s(f)}) and C(f) < 2^{s(f)-1} s(f); these in turn imply various corollaries regarding the relation between sensitivity and other complexity measures, such as block sensitivity, via known results. The gap between sensitivity and other complexity measures remains exponential but these results are the first improvement for this difficult problem that has been achieved in a decade.Comment: This is the merged form of arXiv submission 1306.4466 with another work. Appeared in ICALP 2014, 14 page

Unitarity Corrections to the Proton Structure Functions through the Dipole Picture

We study the dipole picture for the description of the deep inelastic scattering, focusing on the structure functions which are driven directly by the gluon distribution. One performs estimates using the effective dipole cross section given by the Glauber-Mueller approach in QCD, which encodes the corrections due to the unitarity effects associated with the saturation phenomenon. We also address issues about frame invariance of the calculations when analysing the observables.Comment: 16 pages, 8 figures. Version to be published in Phys. Rev.

Pole Dancing: 3D Morphs for Tree Drawings

We study the question whether a crossing-free 3D morph between two straight-line drawings of an $n$-vertex tree can be constructed consisting of a small number of linear morphing steps. We look both at the case in which the two given drawings are two-dimensional and at the one in which they are three-dimensional. In the former setting we prove that a crossing-free 3D morph always exists with $O(\log n)$ steps, while for the latter $\Theta(n)$ steps are always sufficient and sometimes necessary.Comment: Appears in the Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018

Decisive test for the Pomeron at Tevatron

We propose a new measurement to be performed at the Tevatron which can be decisive to distinguish between Pomeron-based and soft color interaction models of hard diffractive scattering.Comment: 5 pages, 3 figures, 1 tabel revtex forma

Testing the black disk limit in pppp collisions at very high energy

We use geometric scaling invariant quantities to measure the approach, or not, of the imaginary and real parts of the elastic scattering amplitude, to the black disk limit, in $pp$ collisions at very high energy.Comment: 11 pages, 4 figure